package math.leetcode_461;

public class rightMove {
    public int hammingDistance(int x, int y) {
        int num = x ^ y;
        int temp = 1;
        int bitCount = 0;
        while (num != 0) {
            bitCount += (num & temp);
            num >>>= 1;
        }
        return bitCount;
    }
}
